Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
B-tree - перевод на Английский
A SELF-BALANCING, TREE-BASED DATA STRUCTURE, THAT ALLOWS READ/WRITE ACCESS IN LOGARITHMIC TIME
B tree; B-Tree; B-trees; B*-tree; B* tree; B-star tree; Btree; Btrees; B tree indexing; Bayer tree; B Tree; B.tree; BTree
B-tree
شجرة B ، شجرة مفهرسة
b
![A metal letter "B" with its [[homophone]], a [[bee]] insect, standing on it](https://commons.wikimedia.org/wiki/Special:FilePath/Big-small-B.jpg?width=200 "A metal letter \"B\" with its [[homophone]], a [[bee]] insect, standing on it")
![Late [[Renaissance]] or early [[Baroque]] design of a B, from 1627](https://commons.wikimedia.org/wiki/Special:FilePath/Newes ABC Buchlein MET DP855602.jpg?width=200 "Late [[Renaissance]] or early [[Baroque]] design of a B, from 1627")
SECOND LETTER OF THE LATIN ALPHABET
Ｂ; B (letter); B quadratum; B rotundum; Silent b; ASCII 66; ASCII 98; \x42; U+0042; U+0062
اسْم : الحرف الثاني من الأبجدية الإنكليزية
B
SECOND LETTER OF THE LATIN ALPHABET
Ｂ; B (letter); B quadratum; B rotundum; Silent b; ASCII 66; ASCII 98; \x42; U+0042; U+0062
رمز البور:ب; B,رمز البارْن:وحدة قياس المساحات الدقيقة وتعادل 10 قوة -28 سنتي متراً مربعا
Определение
B-tree
<algorithm> A multi-way balanced tree.
The "B" in B-tree has never been officially defined. It could
stand for "balanced" or "Bayer", after one of the original
designers of the algorithms and structure. A B-tree is _not_
(necessarily?) a "binary tree".
A B+-tree (as used by IBM's VSAM) is a B-tree where the
leaves are also linked sequentially, thus allowing both fast
random access and sequential access to data.
[Knuth's Art of Computer Programming ].
[Example algorithm? ]
(2000-01-10)
Википедия
B-tree
In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children. Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as databases and file systems.
